Efficient Tests under a Weak Convergence Assumption∗

نویسنده

  • Ulrich K. Müller
چکیده

The asymptotic validity of tests is usually established by making appropriate primitive assumptions, which imply the weak convergence of a specific function of the data, and an appeal to the continuous mapping theorem. This paper, instead, takes the weak convergence of some function of the data to a limiting random element as the starting point, and studies efficiency in the class of tests that remain asymptotically valid for all models that induce the same weak limit. It is found that efficient tests in this class are simply given by efficient tests in the limiting problem–that is, with the limiting random element assumed observed–evaluated at sample analogues. Efficient tests in the limiting problem are usually straightforward to derive, even in non-standard testing problems. What is more, their evaluation at sample analogues typically yields tests that coincide with suitably robustified versions of optimal tests in canonical parametric versions of the model. This paper thus establishes an alternative and broader sense of asymptotic efficiency for many previously derived tests in econometrics, such as tests for unit roots, parameter stability tests and tests about regression coefficients under weak instruments. JEL classification: C12, C14

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternative Sense of Asymptotic Efficiency

The paper studies the asymptotic efficiency and robustness of hypothesis tests when models of interest are defined in terms of a weak convergence property. The null and local alternatives induce different limiting distributions for a random element, and a test is considered robust if it controls asymptotic size for all data generating processes for which the random element has the null limiting...

متن کامل

Projected Semi-Stochastic Gradient Descent Method with Mini-Batch Scheme under Weak Strong Convexity Assumption

We propose a projected semi-stochastic gradient descent method with mini-batch for improving both the theoretical complexity and practical performance of the general stochastic gradient descent method (SGD). We are able to prove linear convergence under weak strong convexity assumption. This requires no strong convexity assumption for minimizing the sum of smooth convex functions subject to a c...

متن کامل

Learning from MOM’s principles

We obtain estimation error rates and sharp oracle inequalities for a Birgé’s T-estimator using a regularized median of mean principle as based tests. The results hold with exponentially large probability – the same one as in the gaussian framework with independent noise– under only weak moments assumption like a L4/L2 assumption and without assuming independence between the noise and the design...

متن کامل

Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption

In this paper we generalize the framework of the feasible descent method (FDM) to a randomized (R-FDM) and a coordinate-wise random feasible descent method (RC-FDM) framework. We show that the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-FDM. We prove linear convergence for both R-FDM ...

متن کامل

Weak convergence and averaging for ODE

This mostly expository paper shows how weak convergence methods provide simple, elegant proofs of (i) the stabilization of an inverted pendulum under fast vertical oscillations, (ii) the existence of particle traps induced by rapidly varying electric fields and (iii) the adiabatic invariance of ∫ Γ p dx for slowing varying planar Hamiltonian dynamics. Under an appropriate, but very restrictive,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008